Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Synchronous control of neural network based on event-triggered mechanism
Chao GE, Chenlei CHANG, Zheng YAO, Hao SU
Journal of Computer Applications    2023, 43 (5): 1641-1646.   DOI: 10.11772/j.issn.1001-9081.2022040588
Abstract292)   HTML1)    PDF (1542KB)(165)       Save

Concerning the problem of random perturbation of controller in synchronous control of neural network with mixed delays, a non-fragile controller based on event-triggered mechanism was proposed. Firstly, a random variable obeying Bernoulli distribution was used to describe the randomness of the existence of controller gain disturbance. Secondly, the event-triggered mechanism was introduced in the synchronous control process of the neural network. Next, a novel bilateral Lyapunov function was constructed to fully consider the system status information, while the functional derivatives were scaled by an improved integral inequality to obtain sufficient conditions for the exponential stability of the synchronization error system. Finally, a non-fragile controller was designed based on the decoupling technique. The effectiveness of the proposed controller was verified by simulation examples. Experimental results show that compared with the existing exponential attenuation coefficient under the same sampling period in the four-tank system, the exponential attenuation coefficient obtained by the proposed controller is improved by 0.16.

Table and Figures | Reference | Related Articles | Metrics
Non-fragile dissipative control scheme for event-triggered networked systems
Chao GE, Yaxin ZHANG, Yue LIU, Hong WANG
Journal of Computer Applications    2023, 43 (2): 615-621.   DOI: 10.11772/j.issn.1001-9081.2022010007
Abstract262)   HTML6)    PDF (2029KB)(59)       Save

For the problems of limited bandwidth resources, the existence of external disturbance and parameter uncertainty, a non-fragile dissipative control scheme for event-triggered networked systems was proposed. Firstly, based on the Networked Control System (NCS) model, a non-periodic sampling event-triggered scheme was proposed, and a delay closed-loop system model was established. Then, a novel bilateral Lyapunov functional was constructed by using the structure characteristics of sawtooth wave. Finally, the sufficient conditions to ensure the stability of the system were derived by using methods such as Jensen inequality, free weight matrix and convex combination, and the gain of the feedback controller was calculated. The results of numerical simulation show that the proposed bilateral functional is less conservative than the unilateral functional, the event-triggered mechanism can save bandwidth compared with the common sampling mechanism, and the proposed controller is feasible.

Table and Figures | Reference | Related Articles | Metrics
Design and realization of dynamic service-oriented optimization computing platform of BlackBox
QI Chao George Cheng ZHANG Zhe
Journal of Computer Applications    2014, 34 (5): 1255-1258.   DOI: 10.11772/j.issn.1001-9081.2014.05.1255
Abstract470)      PDF (723KB)(324)       Save

Aiming at the problem of high computational cost of the BlackBox of the engineering optimizations, a River-based Dynamic Service-oriented Optimization Computing Platform (R-DSOCP) was proposed to calculate the BlackBox in a distributed and parallel way. Firstly, the running pattern of BlackBox in the optimization algorithms was analyzed. Conforming to the dynamic service-oriented architecture and surrounding the functions of service release and lookup of River, the kernel services required for building R-DSOCP were designed. Secondly, an ACO-based BlackBox Schedule Problem (BSP) algorithm was devised. Depending on it, the scheduling service could not only choose the best computing services for BlackBox quickly but also balance the load of R-DSOCP. At Last, the experimental results show that the BlackBox can be parallel performed on the platform effectively after separating the BlackBox’s computation from the execution of the optimization algorithm. Comparing with a single computing machine, the average computing efficiency is advanced nearly n times. n is the parallel factor. Thus, with the help of High Performance Computing (HPC) technology, R-DSOCP can offer a feasible scheme for accelerating the optimization algorithm and reducing the computational expenses in the field of engineering optimization.

Reference | Related Articles | Metrics
Secure quantum communication protocol based on symmetric W state and identity authentication
LIU Chao GENG Huantong LIU Wenjie
Journal of Computer Applications    2014, 34 (2): 438-441.  
Abstract557)      PDF (600KB)(559)       Save
Due to the better robustness of entangled W state, it is considered to be better qualified as information carrier for quantum information processing and quantum secure communication. Recently, many kinds of quantum direct communication protocols based on four-particle W state or three-particle asymmetric W state have been proposed. However, these protocols either have low communication efficiency or are difficult to be implemented in physics experiment. By utilizing three-particle W state and the mechanism of quantum identity authentication, a new deterministic secure quantum communication protocol was proposed. This protocol consisted of five parts: authentication code generating, quantum states preparation, quantum states distribution, eavesdropping check and identity authentication, and information communication. The two participants only needed to perform the two-particle Bell measurement, the single-particle 〖WTBX〗Z〖WTBZ〗-basis or 〖WTBX〗X〖WTBZ〗-basis measurement, and the communication efficiency was also improved: One W state can transmit one classical bit of information. The security analysis shows that the present protocol is secure against various eavesdropper Eve's attacks and impersonation attacks, so it has better security.
Related Articles | Metrics
Image retrieval based on K-means clustering and multiple instance learning
WEN Chao GENG Guohua LI Zhan
Journal of Computer Applications    2011, 31 (06): 1546-1548.   DOI: 10.3724/SP.J.1087.2011.01546
Abstract1351)      PDF (609KB)(517)       Save
Aiming at the problem of object-based image retrieval, a novel algorithm named KP-MIL was proposed, which worked in the Multiple Instance Learning (MIL) framework. Firstly, this algorithm clustered the instances in positive set and negative set, and found the potential positive instance and bag structure. Then an alpha coefficient was introduced to trade off between positive instance and bags similarity. Experiments on SIGVAL dataset show that this algorithm is feasible, and the performance is superior to other MIL algorithms.
Related Articles | Metrics